Asynchronous P systems for hard graph problems
نویسندگان
چکیده
منابع مشابه
Asynchronous P Systems
In this paper, the authors propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the field of distributed algorithms. The authors validate the proposed approach by implementing several well-known distributed depth-first search (DFS) and breadth-first search (BFS) algorithms. Empirical results show that the proposed P algorithms have shorte...
متن کاملAsynchronous spiking neural P systems
We consider here spiking neural P systems with a non-synchronized (i.e., asynchronous) use of rules: in any step, a neuron can apply or not apply its rules which are enabled by the number of spikes it contains (further spikes can come, thus changing the rules enabled in the next step). Because the time between two firings of the output neuron is now irrelevant, the result of a computation is th...
متن کاملChapter 5 Asynchronous P Systems
In this paper, the authors propose a new approach to fully asynchronous P systems, and a matching complexity measure, both inspired from the field of distributed algorithms. The authors validate the proposed approach by implementing several well-known distributed depth-first search (DFS) and breadth-first search (BFS) algorithms. Empirical results show that the proposed P algorithms have shorte...
متن کاملAlgorithms and experiments for parameterized approaches to hard graph problems
This thesis is about the design, analysis, implementation, and experimental evaluation of algorithms for hard graph problems. The aim is to establish that the concept of fixed-parameter tractability, and in particular novel algorithmic techniques whose development was driven by this concept, can lead to practically useful programs for exactly solving real-world problem instances. In particular,...
متن کاملA Comparison of Approaches for Solving Hard Graph-Theoretic Problems
In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a typical computer. One sample problem explored is that of finding a minimum identifying code. To work around the computationa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networking and Computing
سال: 2014
ISSN: 2185-2839,2185-2847
DOI: 10.15803/ijnc.4.1_2